integer programming problem meaning in Chinese
整数规划问题
Examples
- Many problems of engineering and system are integer or mixed integer programming problems . lt is well known that the problem of integer programming is a np - hard problem , and the method for it is exponential complex
工程、系统问题中有许多问题属于整数或混合整数规划问题。众所周知，线性整数规划问题是np - hard问题，求解该问题的精确解算法具有指数复杂性。 - However , signals take effect by the switch of signal phases , which introduces integer control values into the traffic control problem , so the traffic control problem becomes a large - scale mixed integer programming problem , the computation of which requires an exponential - complexity optimiz ation algorithm
但是，信号灯通过相位切换对交叉口进行控制，同时也在交通控制模型中引入了整数决策变量，使交通控制模型成为一个大规模混合整数规划问题，需要指数复杂度的优化算法。 - The elip is suitable for the case that the uncontrollable subnet is cascade petri net and some cascade subnets are neither acyclic petri nets nor state graphs , and the main character is that the nonlinear integer program problem is converted into the problem that can be solved by using some standardized mathematical tools
当不可控子网是序状petri网，且无法用整数规划法综合控制器时，可使用扩展线性整数规划法，该方法的优点在于把非线性整数规划转化为可用标准数学工具求解的问题。 - Abstract : a new algorithm w - ecop is presented to effect incremental changes on a standard cell layout automatically . this algorithm deals with cell inserting and cell moving based on rows instead of on cells as most placement algorithms usually do . an integer programming problem is formulated to minimize the adjustment on the initial placement and a heuristic method is presented to search for a shifting path so as to optimize the wirelength . test of w - ecop on a group of practical test cases shows that the algorithm can successfully accomplish incremental placement with good quality and high speed
文摘:提出了一种新的增量式布局方法w - ecop来满足快速调整布局方案的要求.与以前的以单元为中心的算法不同,算法基于单元行划分来进行单元的插入和位置调整,在此过程中使对原布局方案的影响最小,并且尽可能优化线长.一组从美国工业界的测试例子表明,该算法运行速度快,调整后的布局效果好